Knowledge Base Compilation

نویسندگان

  • F. D. Highland
  • Christine T. Iwaskiw
چکیده

The effective use of knowledge based systems technology to solve complex and real-time problems in embedded system environments requires that the performance of these systems be maximized for conventional processor architectures. This paper presents a technique for the complete compilat ion of knowledge bases directly into procedural code. The technique is based on determining what actions an interpretive inference engine would take wi th the specific knowledge base and generating only the code needed to perform those actions. This eliminates the overhead of interpreting a representation of the knowledge base and significantly improves performance. The performance gains produced by this approach wi l l be examined using examples f rom the High Performance [imbedded Reasoning (H iPER) System, a prototype tool which utilizes this technology.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Knowledge Compilation for Product Configuration

In this paper we address the application of knowledge compilation techniques to product configuration problems. We argument that both the process of generating valid configurations, as well as validation of product configuration knowledge bases, can potentially be accelerated by compiling the instance independent part of the knowledge base. Besides giving transformations of both tasks into logi...

متن کامل

Incremental Knowledge Compilation Using the Extension Rule

Knowledge compilation by using the extension rule (KCER) has been recognized as a novel compilation approach, although this method can only deal with static knowledge bases. This paper proposes a novel incremental knowledge compilation method by using the extension rule so that it can tackle knowledge compilation problems in the dynamic environment. The method does not recompile the whole knowl...

متن کامل

Approximate Knowledge Compilation : The First Order

Knowledge compilation procedures make a knowledge base more explicit so as make inference with respect to the compiled knowledge base tractable or at least more eecient. Most work to date in this area has been restricted to the propositional case, despite the importance of rst order theories for expressing knowledge concisely. Focusing on (LUB) approximate compilation (Selman and Kautz 1991), o...

متن کامل

A Kind of Logical Compilation for Knowledge Bases

Mathieu, Ph. and J.-P. Delahaye, A kind of logical compilation for knowledge bases, Theoretical Computer Science 131 (1994) 197-218. The forward chaining algorithm is perhaps the best-known algorithm in expert systems. However, it is not complete because it cannot compute the two-valued consequence literals of a propositional knowledge base (i.e. set of rules) with negations. If the user wants ...

متن کامل

Exact Kanowledge Compilation in Predicate Calculus: The Partial Achievement Case

Forward chaining is an inference algorithm based on modus ponens which is widely used but unfortunately incomplete with respect to the usual boolean logic. A solution to this incompleteness is to compile the knowledge base so that forward chaining becomes complete for any base of facts. This compilation is called achievement and was so far restricted to propositional calculus. In this paper, we...

متن کامل

Knowledge Compilation Using Theory Prime Implicates

In this paper, we are mainly concerned with logical compilations of propositional knowledge bases. We propose a new approach to equivalence-preserving knowledge compilation based on a generalization of the standard notion of prime implicate, the theory prime implicates. Our approach consists in taking advantage of tractable theories implied by the knowledge base to make local by computing the t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1989